ABS methods and ABSPACK for linear systems and optimization: A review

نویسندگان

  • Emilio Spedicato
  • Elena Bodon
  • Antonino Del Popolo
  • Nezam Mahdavi-Amiri
چکیده

ABS methods are a large class of methods, based upon the Egervary rank reducing algebraic process, rst introduced in 1984 by Aba y, Broyden and Spedicato for solving linear algebraic systems, and later extended to nonlinear algebraic equations, to optimization problems and other elds; software based upon ABS methods is now under development. Current ABS literature consists of about 400 papers. ABS methods provide a uni cation of several classes of classical algorithms and more e cient new solvers for a number of problems. In this paper we review ABS methods for linear systems and optimization, from both the point of view of theory and the numerical performance of ABSPACK.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Se p 20 02 ABS Methods and ABSPACK for Linear Systems and Optimization , a Review

ABS methods are a large class of methods, based upon the Egervary rank reducing algebraic process, first introduced in 1984 by Abaffy, Broyden and Spedicato for solving linear algebraic systems, and later extended to nonlinear algebraic equations, to optimization problems and other fields; software based upon ABS methods is now under development. Current ABS literature consists of about 400 pap...

متن کامل

Abs Algorithms for Linear Equations and Abspack

We present the main results obtained during a research on ABS methods in the framework of the project Analisi Numerica e Matematica Computazionale. 1. – The ABS algorithms. ABS algorithms were introduced by Abaffy, Broyden and Spedicato (1984), to solve linear equations first in the form of the basic ABS class, later generalized as the scaled ABS class and applied to linear least squares, nonli...

متن کامل

A new multi-step ABS model to solve full row rank linear systems

ABS methods are direct iterative methods for solving linear systems of equations, where the i-th iteration satisfies the first i equations. Thus, a system of m equations is solved in at most m ABS iterates. In 2004 and 2007, two-step ABS methods were introduced in at most [((m+1))/2] steps to solve full row rank linear systems of equations. These methods consuming less space, are more compress ...

متن کامل

Abs Algorithms for Linear Systems and Optimization: a Review and a Bibliography

In this paper, we 1. The scaled ABS class. ABS methods have been introduced by Abaffy, Broyden and Spedicato (1984), in a paper where the solution of linear algebraic equations was considered via the so called ABS unscaled or basic class. That class was later generalized to the so called scaled ABS class and then applied also to the solution of linear least squares, nonlinear algebraic equation...

متن کامل

Exact and approximate solutions of fuzzy LR linear systems: New algorithms using a least squares model and the ABS approach

We present a methodology for characterization and an approach for computing the solutions of fuzzy linear systems with LR fuzzy variables. As solutions, notions of exact and approximate solutions are considered. We transform the fuzzy linear system into a corresponding linear crisp system and a constrained least squares problem. If the corresponding crisp system is incompatible, then the fuzzy ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • 4OR

دوره 1  شماره 

صفحات  -

تاریخ انتشار 2003